cost minimizing problem

См. также в других словарях:

• Assignment problem — The assignment problem is one of the fundamental combinatorial optimization problems in the branch of optimization or operations research in mathematics. It consists of finding a maximum weight matching in a weighted bipartite graph. In its most… …   Wikipedia

• Closure problem — A Closure problem is a problem in graph theory for finding a set of vertices in a directed graph such that there are no edges from the set to the rest of the graph. More specifically, the minimum closure problem asks for a set of this type with… …   Wikipedia

• Quadratic assignment problem — The quadratic assignment problem (QAP) is one of fundamental combinatorial optimization problems in the branch of optimization or operations research in mathematics, from the category of the facilities location problems.The problem models the… …   Wikipedia

• Vehicle routing problem — The vehicle routing problem (VRP) is a combinatorial optimization and nonlinear programming problem seeking to service a number of customers with a fleet of vehicles. Proposed by Dantzig and Ramser in 1959, VRP is an important problem in the… …   Wikipedia

• Cutting stock problem — The cutting stock problem is an optimization problem, or more specifically, an integer linear programming problem. It arises from many applications in industry. Imagine that you work in a paper mill and you have a number of rolls of paper of… …   Wikipedia

• Isocost — In economics an isocost line represents a combination of inputs which all cost the same amount. Although similar to the budget constraint in consumer theory, the use of the isocost pertains to cost minimization in production, as opposed to… …   Wikipedia

• production, theory of — ▪ economics Introduction       in economics, an effort to explain the principles by which a business firm decides how much of each commodity that it sells (its “outputs” or “products”) it will produce, and how much of each kind of labour, raw… …   Universalium

• Cambridge capital controversy — The Cambridge capital controversy was a 1960s debate in economics concerning the nature and role of capital goods (or means of production). The name arises because of the location of those most involved in the controversy: the debate was largely… …   Wikipedia

• Hungarian algorithm — The Hungarian method is a combinatorial optimization algorithm which solves the assignment problem in polynomial time and which anticipated later primal dual methods. It was developed and published by Harold Kuhn in 1955, who gave the name… …   Wikipedia

• Model predictive control — Model Predictive Control, or MPC, is an advanced method of process control that has been in use in the process industries such as chemical plants and oil refineries since the 1980s. Model predictive controllers rely on dynamic models of the… …   Wikipedia

• Stigler diet — The Stigler Diet is an optimization problem named for George Stigler, a 1982 Nobel Laureate in economics, who posed the following problem: For a moderately active man weighing 154 pounds, how much of each of 77 foods should be eaten on a daily… …   Wikipedia